Order:
  1.  22
    Some theorems on the algorithmic approach to probability theory and information theory:(1971 dissertation directed by AN Kolmogorov).Leonid A. Levin - 2010 - Annals of Pure and Applied Logic 162 (3):224-235.
  2.  33
    Complex tilings.Bruno Durand, Leonid A. Levin & Alexander Shen - 2008 - Journal of Symbolic Logic 73 (2):593-613.
    We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  17
    Occam bound on lowest complexity of elements.Leonid A. Levin - 2016 - Annals of Pure and Applied Logic 167 (10):897-900.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark